Nonserial dynamic programming and local decomposition algorithms in discrete programming
نویسندگان
چکیده
One of perspective ways to exploit sparsity in the dependency graph of an optimization problem is nonserial dynamic programming (NSDP) which allows to compute solution in stages, each of them uses results from previous stages. The class of discrete optimization problems with the block-tree matrix of constraints is considered. Nonserial dynamic programming (NSDP) algorithm for the solution of this class of problems is proposed. Properties of NSDP algorithm for the solution of the problems of this class are investigated.
منابع مشابه
Nonserial Dynamic Programming and Tree Decomposition in Discrete Optimization
Solving discrete optimization problems (DOP) can be a rather hard task. Many real DOPs contain a huge number of variables and/or constraints that make the models intractable for currently available solvers. There are few approaches for solving DOPs: tree search approaches (e.g., branch and bound), relaxation and decomposition methods. Large DOPs can be solved due to their special structure. Amo...
متن کاملOrdering techniques for local elimination algorithms ∗
The use of discrete optimization (DO) models and algorithms makes it possible to solve many reallife problems in scheduling theory, optimization on networks, routing in communication networks, facility location in enterprize resource planing, and logistics. Applications of DO in the artificial intelligence field include theorem proving, SAT in propositional logic, robotics problems, inference c...
متن کاملar X iv : 1 10 7 . 18 93 v 1 [ cs . D M ] 1 0 Ju l 2 01 1 Benchmarking ordering techniques for nonserial dynamic programming ∗
Five ordering algorithms for the nonserial dynamic programming algorithm for solving sparse discrete optimization problems are compared in this paper. The benchmarking reveals that the ordering of the variables has a significant impact on the run-time of these algorithms. In addition, it is shown that different orderings are most effective for different classes of problems. Finally, it is shown...
متن کاملBenchmarking ordering techniques for nonserial dynamic programming
Five ordering algorithms for the nonserial dynamic programming algorithm for solving sparse discrete optimization problems are compared in this paper. The benchmarking reveals that the ordering of the variables has a significant impact on the run-time of these algorithms. In addition, it is shown that different orderings are most effective for different classes of problems. Finally, it is shown...
متن کاملA dynamic programming approach for solving nonlinear knapsack problems
Nonlinear Knapsack Problems (NKP) are the alternative formulation for the multiple-choice knapsack problems. A powerful approach for solving NKP is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. Despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006